Belief Propagation for Maximum Coverage on Weighted Bipartite Graph and Application to Text Summarization
نویسندگان
چکیده
منابع مشابه
Loopy Belief Propagation for Bipartite Maximum Weight b-Matching
We formulate the weighted b-matching objective function as a probability distribution function and prove that belief propagation (BP) on its graphical model converges to the optimum. Standard BP on our graphical model cannot be computed in polynomial time, but we introduce an algebraic method to circumvent the combinatorial message updates. Empirically, the resulting algorithm is on average fas...
متن کاملDynamic Programming Bipartite Belief Propagation For Hyper Graph Matching
Hyper graph matching problems have drawn attention recently due to their ability to embed higher order relations between nodes. In this paper, we formulate hyper graph matching problems as constrained MAP inference problems in graphical models. Whereas previous discrete approaches introduce several global correspondence vectors, we introduce only one global correspondence vector, but several lo...
متن کاملBelief propagation for graph partitioning
We study the belief propagation algorithm for the graph bipartitioning problem, i.e. the ground state of the ferromagnetic Ising model at a fixed magnetization. Application of a message passing scheme to a model with a fixed global parameter is not banal and we show that the magnetization can in fact be fixed in a local way within the belief propagation equations. Our method provides the full p...
متن کاملText Summarization Model Based on Maximum Coverage Problem and its Variant
We discuss text summarization in terms of maximum coverage problem and its variant. We explore some decoding algorithms including the ones never used in this summarization formulation, such as a greedy algorithm with performance guarantee, a randomized algorithm, and a branch-andbound method. On the basis of the results of comparative experiments, we also augment the summarization model so that...
متن کاملBudgeted Maximum Graph Coverage
An instance of the maximum coverage problem is given by a set of weighted ground elements and a cost weighted family of subsets of the ground element set. The goal is to select a subfamily of total cost of at most that of a given budget maximizing the weight of the covered elements. We formulate the problem on graphs: In this situation the set of ground elements is specified by the nodes of a g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Physical Society of Japan
سال: 2020
ISSN: 0031-9015,1347-4073
DOI: 10.7566/jpsj.89.043801